Search by Ideal Candidates: Next Generation of Talent Search at LinkedIn
نویسندگان
چکیده
One key challenge in talent search is how to translate complex criteria of a hiring position into a search query. This typically requires deep knowledge on which skills are typically needed for the position, what are their alternatives, which companies are likely to have such candidates, etc. However, listing examples of suitable candidates for a given position is a relatively easy job. Therefore, in order to help searchers overcome this challenge, we design a next generation of talent search paradigm at LinkedIn: Search by Ideal Candidates. This new system only needs the searcher to input one or several examples of suitable candidates for the position. The system will generate a query based on the input candidates and then retrieve and rank results based on the query as well as the input candidates. The query is also shown to the searcher to make the system transparent and to allow the searcher to interact with it. As the searcher modifies the initial query and makes it deviate from the ideal candidates, the search ranking function dynamically adjusts an refreshes the ranking results balancing between the roles of query and ideal candidates. As of writing this paper, the new system is being launched to our customers.
منابع مشابه
The Search for Economics Talent: Doctoral Completion and Research Productivity
Economists hold an annual talent search in which students from around the world apply to doctoral programs and economics departments. Top economics PhD programs seek candidates with the preparation, aptitude, drive, and creativity to become academic professionals whose research will advance the frontiers of the discipline. Admission committee members must judge students’ potential economic tale...
متن کاملOptimal reconfiguration of radial distribution system with the aim of reducing losses and improving voltage profiles using the improved lightning search algorithm
In this paper, a modified version of the lightning search algorithm is proposed in order to find the optimal reconfiguration of the switches and locate and determine the optimal capacity of distributed generation sources in the distribution feeder. The main optimization goals are to reduce ohmic losses and voltage deviations in the standard 33-bus and 94-node IEEE feeders. The simulation result...
متن کاملOptimization of Mixed-Integer Non-Linear Electricity Generation Expansion Planning Problem Based on Newly Improved Gravitational Search Algorithm
Electricity demand is forecasted to double in 2035, and it is vital to address the economicsof electrical energy generation for planning purposes. This study aims to examine the applicability ofGravitational Search Algorithm (GSA) and the newly improved GSA (IGSA) for optimization of themixed-integer non-linear electricity generation expansion planning (GEP) problem. The performanceindex of GEP...
متن کاملApplication of Tabu Search to Optimal Placement of Distributed Generation and Reactive Power Sources
Introducing distributed generation into a power system can lead to numerous benefits including technical, economic, environmental, etc. To attain these benefits, distributed generators with proper rating should be installed at suitable locations. Given the similar effects of distributed generators and capacitor banks on operation indices of a distribution system, simultaneous assignment of best...
متن کاملMulti-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect
This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance. First the problem is encoded with a...
متن کامل